0.06/0.12	% Problem    : theBenchmark.p : TPTP v0.0.0. Released v0.0.0.
0.06/0.15	% Command    : eprover-ho %s --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --free-numbers -auto-schedule -p --cpu-limit=%d --neg-ext=all --pos-ext=all --ext-sup-max-depth=2 --schedule-kind=CASC
0.14/0.36	% Computer   : n024.cluster.edu
0.14/0.36	% Model      : x86_64 x86_64
0.14/0.36	% CPU        : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
0.14/0.36	% Memory     : 8042.1875MB
0.14/0.36	% OS         : Linux 3.10.0-693.el7.x86_64
0.14/0.36	% CPULimit   : 1200
0.14/0.36	% WCLimit    : 120
0.14/0.36	% DateTime   : Tue Jul 13 12:51:48 EDT 2021
0.14/0.36	% CPUTime    : 
0.14/0.36	% Number of cores: 8
0.14/0.36	% Python version: Python 3.6.8
0.14/0.36	# Version: 2.6rc1-ho
0.14/0.38	# No SInE strategy applied
0.14/0.38	# Trying AutoSched0 for 59 seconds
59.22/59.38	# AutoSched0-Mode selected heuristic G_E___208_C18AMC_F1_SE_CS_SP_PS_S5PRR_RG_S04AN
59.22/59.38	# and selection function SelectComplexExceptUniqMaxHorn.
59.22/59.38	#
59.22/59.38	# Preprocessing time       : 0.131 s
59.22/59.38	# Presaturation interreduction done
59.31/59.51	# No success with AutoSched0
59.31/59.51	# Trying AutoSched1 for 26 seconds
59.87/60.08	# AutoSched1-Mode selected heuristic G_E___301_C18_F1_URBAN_S5PRR_S0Y
59.87/60.08	# and selection function SelectMaxLComplexAvoidPosPred.
59.87/60.08	#
59.87/60.08	# Preprocessing time       : 0.062 s
59.87/60.08	
59.87/60.08	# Proof found!
59.87/60.08	# SZS status Theorem
59.87/60.08	# SZS output start CNFRefutation
59.87/60.08	thf(fact_0__092_060open_062_I_092_060forall_062bs_O_AIpoly_Abs_A_Ip_A_K_092_060_094sub_062p_Aq_J_A_061_AIpoly_Abs_A_Iq_A_K_092_060_094sub_062p_Ap_J_J_A_061_A_Ip_A_K_092_060_094sub_062p_Aq_A_061_Aq_A_K_092_060_094sub_062p_Ap_J_092_060close_062, axiom, (![X300:list_a]:(polyno422358502poly_a @ X300 @ (polyno1934269411ymul_a @ p @ q))=(polyno422358502poly_a @ X300 @ (polyno1934269411ymul_a @ q @ p))<=>(polyno1934269411ymul_a @ p @ q)=(polyno1934269411ymul_a @ q @ p)), file('/export/starexec/sandbox/benchmark/theBenchmark.p', fact_0__092_060open_062_I_092_060forall_062bs_O_AIpoly_Abs_A_Ip_A_K_092_060_094sub_062p_Aq_J_A_061_AIpoly_Abs_A_Iq_A_K_092_060_094sub_062p_Ap_J_J_A_061_A_Ip_A_K_092_060_094sub_062p_Aq_A_061_Aq_A_K_092_060_094sub_062p_Ap_J_092_060close_062)).
59.87/60.08	thf(conj_0, conjecture, (polyno1934269411ymul_a @ p @ q)=(polyno1934269411ymul_a @ q @ p), file('/export/starexec/sandbox/benchmark/theBenchmark.p', conj_0)).
59.87/60.08	thf(fact_10_polymul, axiom, ![X20:list_a, X21:polyno727731844poly_a, X64:polyno727731844poly_a]:(polyno422358502poly_a @ X20 @ (polyno1934269411ymul_a @ X21 @ X64))=(times_times_a @ (polyno422358502poly_a @ X20 @ X21) @ (polyno422358502poly_a @ X20 @ X64)), file('/export/starexec/sandbox/benchmark/theBenchmark.p', fact_10_polymul)).
59.87/60.08	thf(fact_29_Ipoly_Osimps_I6_J, axiom, ![X20:list_a, X209:polyno727731844poly_a, X210:polyno727731844poly_a]:(polyno422358502poly_a @ X20 @ (polyno1491482291_Mul_a @ X209 @ X210))=(times_times_a @ (polyno422358502poly_a @ X20 @ X209) @ (polyno422358502poly_a @ X20 @ X210)), file('/export/starexec/sandbox/benchmark/theBenchmark.p', fact_29_Ipoly_Osimps_I6_J)).
59.87/60.08	thf(fact_132_mult_Ocommute, axiom, (times_times_a)=(^[X335:a, X336:a]:times_times_a @ X336 @ X335), file('/export/starexec/sandbox/benchmark/theBenchmark.p', fact_132_mult_Ocommute)).
59.87/60.08	thf(c_0_5, plain, ![X2220:list_a]:(((polyno422358502poly_a @ esk38_0 @ (polyno1934269411ymul_a @ p @ q))!=(polyno422358502poly_a @ esk38_0 @ (polyno1934269411ymul_a @ q @ p))|(polyno1934269411ymul_a @ p @ q)=(polyno1934269411ymul_a @ q @ p))&((polyno1934269411ymul_a @ p @ q)!=(polyno1934269411ymul_a @ q @ p)|(polyno422358502poly_a @ X2220 @ (polyno1934269411ymul_a @ p @ q))=(polyno422358502poly_a @ X2220 @ (polyno1934269411ymul_a @ q @ p)))), inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[fact_0__092_060open_062_I_092_060forall_062bs_O_AIpoly_Abs_A_Ip_A_K_092_060_094sub_062p_Aq_J_A_061_AIpoly_Abs_A_Iq_A_K_092_060_094sub_062p_Ap_J_J_A_061_A_Ip_A_K_092_060_094sub_062p_Aq_A_061_Aq_A_K_092_060_094sub_062p_Ap_J_092_060close_062])])])])).
59.91/60.08	thf(c_0_6, negated_conjecture, (polyno1934269411ymul_a @ p @ q)!=(polyno1934269411ymul_a @ q @ p), inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[conj_0])])).
59.91/60.08	thf(c_0_7, plain, ![X2025:list_a, X2026:polyno727731844poly_a, X2027:polyno727731844poly_a]:(polyno422358502poly_a @ X2025 @ (polyno1934269411ymul_a @ X2026 @ X2027))=(times_times_a @ (polyno422358502poly_a @ X2025 @ X2026) @ (polyno422358502poly_a @ X2025 @ X2027)), inference(variable_rename,[status(thm)],[fact_10_polymul])).
59.91/60.08	thf(c_0_8, plain, ![X1718:list_a, X1719:polyno727731844poly_a, X1720:polyno727731844poly_a]:(polyno422358502poly_a @ X1718 @ (polyno1491482291_Mul_a @ X1719 @ X1720))=(times_times_a @ (polyno422358502poly_a @ X1718 @ X1719) @ (polyno422358502poly_a @ X1718 @ X1720)), inference(variable_rename,[status(thm)],[fact_29_Ipoly_Osimps_I6_J])).
59.91/60.08	thf(c_0_9, plain, ![X335:a, X336:a]:(times_times_a @ X335 @ X336)=(times_times_a @ X336 @ X335), inference(fof_simplification,[status(thm)],[fact_132_mult_Ocommute])).
59.91/60.08	thf(c_0_10, plain, ((polyno1934269411ymul_a @ p @ q)=(polyno1934269411ymul_a @ q @ p)|(polyno422358502poly_a @ esk38_0 @ (polyno1934269411ymul_a @ p @ q))!=(polyno422358502poly_a @ esk38_0 @ (polyno1934269411ymul_a @ q @ p))), inference(split_conjunct,[status(thm)],[c_0_5])).
59.91/60.08	thf(c_0_11, negated_conjecture, (polyno1934269411ymul_a @ p @ q)!=(polyno1934269411ymul_a @ q @ p), inference(split_conjunct,[status(thm)],[c_0_6])).
59.91/60.08	thf(c_0_12, plain, ![X15:polyno727731844poly_a, X20:list_a, X16:polyno727731844poly_a]:(polyno422358502poly_a @ X20 @ (polyno1934269411ymul_a @ X15 @ X16))=(times_times_a @ (polyno422358502poly_a @ X20 @ X15) @ (polyno422358502poly_a @ X20 @ X16)), inference(split_conjunct,[status(thm)],[c_0_7])).
59.91/60.08	thf(c_0_13, plain, ![X15:polyno727731844poly_a, X20:list_a, X16:polyno727731844poly_a]:(polyno422358502poly_a @ X20 @ (polyno1491482291_Mul_a @ X15 @ X16))=(times_times_a @ (polyno422358502poly_a @ X20 @ X15) @ (polyno422358502poly_a @ X20 @ X16)), inference(split_conjunct,[status(thm)],[c_0_8])).
59.91/60.08	thf(c_0_14, plain, ![X1984:a, X1985:a]:(times_times_a @ X1984 @ X1985)=(times_times_a @ X1985 @ X1984), inference(variable_rename,[status(thm)],[c_0_9])).
59.91/60.08	thf(c_0_15, plain, (polyno422358502poly_a @ esk38_0 @ (polyno1934269411ymul_a @ q @ p))!=(polyno422358502poly_a @ esk38_0 @ (polyno1934269411ymul_a @ p @ q)), inference(sr,[status(thm)],[c_0_10, c_0_11])).
59.91/60.08	thf(c_0_16, plain, ![X15:polyno727731844poly_a, X20:list_a, X16:polyno727731844poly_a]:(polyno422358502poly_a @ X20 @ (polyno1934269411ymul_a @ X15 @ X16))=(polyno422358502poly_a @ X20 @ (polyno1491482291_Mul_a @ X15 @ X16)), inference(rw,[status(thm)],[c_0_12, c_0_13])).
59.91/60.08	thf(c_0_17, plain, ![X9:a, X8:a]:(times_times_a @ X8 @ X9)=(times_times_a @ X9 @ X8), inference(split_conjunct,[status(thm)],[c_0_14])).
59.91/60.08	thf(c_0_18, plain, (polyno422358502poly_a @ esk38_0 @ (polyno1491482291_Mul_a @ q @ p))!=(polyno422358502poly_a @ esk38_0 @ (polyno1491482291_Mul_a @ p @ q)), inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_15, c_0_16]), c_0_16])).
59.91/60.08	thf(c_0_19, plain, ![X20:list_a, X16:polyno727731844poly_a, X15:polyno727731844poly_a]:(polyno422358502poly_a @ X20 @ (polyno1491482291_Mul_a @ X15 @ X16))=(polyno422358502poly_a @ X20 @ (polyno1491482291_Mul_a @ X16 @ X15)), inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_17, c_0_13]), c_0_13])).
59.91/60.08	thf(c_0_20, plain, ($false), inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_18, c_0_19])]), ['proof']).
59.91/60.08	# SZS output end CNFRefutation
59.91/60.08	# Proof object total steps             : 21
59.91/60.08	# Proof object clause steps            : 10
59.91/60.08	# Proof object formula steps           : 11
59.91/60.08	# Proof object conjectures             : 3
59.91/60.08	# Proof object clause conjectures      : 1
59.91/60.08	# Proof object formula conjectures     : 2
59.91/60.08	# Proof object initial clauses used    : 5
59.91/60.08	# Proof object initial formulas used   : 5
59.91/60.08	# Proof object generating inferences   : 1
59.91/60.08	# Proof object simplifying inferences  : 7
59.91/60.08	# Training examples: 0 positive, 0 negative
59.91/60.08	# Parsed axioms                        : 426
59.91/60.08	# Removed by relevancy pruning/SinE    : 0
59.91/60.08	# Initial clauses                      : 1812
59.91/60.08	# Removed in clause preprocessing      : 365
59.91/60.08	# Initial clauses in saturation        : 1447
59.91/60.08	# Processed clauses                    : 2822
59.91/60.08	# ...of these trivial                  : 125
59.91/60.08	# ...subsumed                          : 767
59.91/60.08	# ...remaining for further processing  : 1930
59.91/60.08	# Other redundant clauses eliminated   : 174
59.91/60.08	# Clauses deleted for lack of memory   : 0
59.91/60.08	# Backward-subsumed                    : 5
59.91/60.08	# Backward-rewritten                   : 17
59.91/60.08	# Generated clauses                    : 13178
59.91/60.08	# ...of the previous two non-trivial   : 11749
59.91/60.08	# Contextual simplify-reflections      : 14
59.91/60.08	# Paramodulations                      : 10782
59.91/60.08	# Factorizations                       : 0
59.91/60.08	# NegExts                              : 1034
59.91/60.08	# Equation resolutions                 : 1266
59.91/60.08	# Propositional unsat checks           : 0
59.91/60.08	#    Propositional check models        : 0
59.91/60.08	#    Propositional check unsatisfiable : 0
59.91/60.08	#    Propositional clauses             : 0
59.91/60.08	#    Propositional clauses after purity: 0
59.91/60.08	#    Propositional unsat core size     : 0
59.91/60.08	#    Propositional preprocessing time  : 0.000
59.91/60.08	#    Propositional encoding time       : 0.000
59.91/60.08	#    Propositional solver time         : 0.000
59.91/60.08	#    Success case prop preproc time    : 0.000
59.91/60.08	#    Success case prop encoding time   : 0.000
59.91/60.08	#    Success case prop solver time     : 0.000
59.91/60.08	# Current number of processed clauses  : 1901
59.91/60.08	#    Positive orientable unit clauses  : 214
59.91/60.08	#    Positive unorientable unit clauses: 17
59.91/60.08	#    Negative unit clauses             : 70
59.91/60.08	#    Non-unit-clauses                  : 1600
59.91/60.08	# Current number of unprocessed clauses: 10334
59.91/60.08	# ...number of literals in the above   : 42576
59.91/60.08	# Current number of archived formulas  : 0
59.91/60.08	# Current number of archived clauses   : 22
59.91/60.08	# Clause-clause subsumption calls (NU) : 508854
59.91/60.08	# Rec. Clause-clause subsumption calls : 69604
59.91/60.08	# Non-unit clause-clause subsumptions  : 600
59.91/60.08	# Unit Clause-clause subsumption calls : 42444
59.91/60.08	# Rewrite failures with RHS unbound    : 0
59.91/60.08	# BW rewrite match attempts            : 186
59.91/60.08	# BW rewrite match successes           : 122
59.91/60.08	# Condensation attempts                : 0
59.91/60.08	# Condensation successes               : 0
59.91/60.08	# Termbank termtop insertions          : 423684
59.91/60.08	
59.91/60.08	# -------------------------------------------------
59.91/60.08	# User time                : 58.870 s
59.91/60.08	# System time              : 0.851 s
59.91/60.08	# Total time               : 59.721 s
59.91/60.08	# Maximum resident set size: 2332 pages
59.91/60.08	EOF
